Pair covering designs with block size 5

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Directed covering with block size 5 and v even

A directed covering design, DC(v, k, λ), is a (v, k, 2λ) covering design in which the blocks are regarded as ordered k-tuples and in which each ordered pair of elements occurs in at least λ blocks. Let DE(v, k, λ) denote the minimum number of blocks in a DC(v, k, λ). In this paper the values of the function DE(v, 5, λ) are determined for all even integers v ≥ 5 and λ odd.

متن کامل

Packing designs with block size 6 and index 5

Assaf, A.M., A. Hartman and N. Shalaby, Packing designs with block size 6 and index 5, Discrete Mathematics 103 (1992) 121-128. A (v, K, A) packing design of order v, block size K and index 1 is a collection of K-element subsets, called blocks, of a v-set V such that every 2-subset of V occurs in at most I blocks. The packing problem is to determine the maximum number of blocks in a packing des...

متن کامل

Halving block designs with block size four

B) is said to have the Size Four property if the blocks in B can be partitioned into two isomorphic sets. In this paper we construct block with four with the property, thus the exception of 6 A. Rosa [4]).

متن کامل

On covering designs with block size 5 and index 11≤λ≤21: the case v≡0(mod 4)

Let V be a finite set of order v. A (v,k,A.) covering design of index A. and block size k is a collection of k-element subsets, called blocks, such that every 2-subset of V occurs in at least '}.. blocks. The covering problem is to determine the minimum number of blocks, a (v, k, A.), in a covering design. It is well known that a(v,k''}..)Lr~~=~'}..ll=(v,k,A.), where rxl is the smallest integer

متن کامل

Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four

Let Kq(n, w, t, d) be the minimum size of a code over Zq of length n, constant weight w, such that every word with weight t is within Hamming distance d of at least one codeword. In this article, we determine Kq(n, 4, 3, 1) for all n ≥ 4, q = 3, 4 or q = 2m + 1 with m ≥ 2, leaving the only case (q, n) = (3, 5) in doubt. Our construction method is mainly based on the auxiliary designs, H-frames,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2007

ISSN: 0012-365X

DOI: 10.1016/j.disc.2006.09.026